A novel dynamic reference point model for preference-based evolutionary multiobjective optimization

نویسندگان

چکیده

Abstract In the field of preference-based evolutionary multiobjective optimization, optimization algorithms are required to search for Pareto optimal solutions preferred by decision maker (DM). The reference point is a type techniques that effectively describe preferences DM. So far, either static or interactive with process. However, existing do not cover all application scenarios. A novel case, i.e., changes over time due environment change, has been considered. This paper focuses on problems dynamic First, we propose change model simulate preference DM time. Then, algorithm framework clonal selection (ĝa-NSCSA) and genetic (ĝa-NSGA-II) designed solve such kind problems. addition, in terms practical applications, experiments portfolio tested. Experimental results benchmark applications show ĝa-NSCSA exhibits better performance among compared algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Game Model Based Co-evolutionary Solution for Multiobjective Optimization Problems

The majority of real-world problems encountered by engineers involve simultaneous optimization of competing objectives. In this case instead of single optima, there is a set of alternative trade-offs, generally known as Pareto-optimal solutions. The use of evolutionary algorithms Pareto GA, which was first introduced by Goldberg in 1989, has now become a sort of standard in solving Multiobjecti...

متن کامل

A directed search strategy for evolutionary dynamic multiobjective optimization

Many real-worldmultiobjective optimization problems are dynamic, requiring an optimization algorithm that is able to continuously track the moving Pareto front over time. In this paper, we propose a directed search strategy (DSS) consisting of two mechanisms for improving the performance of multiobjective evolutionary algorithms in changing environments. The first mechanism reinitializes the po...

متن کامل

Evolutionary Optimization of Dynamic Multiobjective Functions

Many real-world problems show both multiobjective as well as dynamic characteristics. In order to use multiobjective evolutionary optimization algorithms (MOEA) efficiently, a systematic analysis of the behavior of these algorithms in dynamic environments is necessary. Dynamic fitness functions can be classified into problems with moving Pareto fronts and Pareto sets having varying speed, shape...

متن کامل

A preference-based evolutionary algorithm for multiobjective optimization: the weighting achievement scalarizing function genetic algorithm

In this paper, we discuss the idea of incorporating preference information into evolutionary multiobjective optimization and propose a preference-based evolutionary approach that can be used as an integral part of an interactive algorithm. One algorithm is proposed in the paper. At each iteration, the decision maker is asked to give preference information in terms of her/his reference point con...

متن کامل

Interactive Fuzzy Modeling by Evolutionary Multiobjective Optimization with User Preference

One of the new trends in genetic fuzzy systems (GFS) is the use of evolutionary multiobjective optimization (EMO) algorithms. This is because EMO algorithms can easily handle two conflicting objectives (i.e., accuracy maximization and complexity minimization) when we design accurate and compact fuzzy rule-based systems from numerical data. Since the main advantage of fuzzy rule-based systems co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Complex & Intelligent Systems

سال: 2022

ISSN: ['2198-6053', '2199-4536']

DOI: https://doi.org/10.1007/s40747-022-00860-0